A family of perpendicular arrays achieving perfect 4-fold secrecy
نویسنده
چکیده
A perpendicular array PA,(t, k, u) is a n(y) by k array A of u distinct symbols, which satisfies: (i) every row of A contains k distinct symbols, (ii) for any t columns, and for any t distinct symbols, there are precisely 2 rows with the given symbols in the given columns. Such a structure may also be described as a A-uniform, t-homogeneous set of injective mappings from a k-set into a u-set. A close connection with t-designs is obvious. In contrast to the situation with designs, it is not clear if a perpendicular t-array PA,(t, k, u) is also a perpendicular s-array PA,,&, k, u) for SC t, where
منابع مشابه
Constructing Optimal Authentication Codes with Perfect Multi-fold Secrecy
We establish a construction of optimal authentication codes achieving perfect multi-fold secrecy by means of combinatorial designs. This continues the author’s work (ISIT 2009, cf. [1]) and answers an open question posed therein. As an application, we present the first infinite class of optimal codes that provide two-fold security against spoofing attacks and at the same time perfect two-fold s...
متن کاملOn the application of LDPC codes to a novel wiretap channel inspired by quantum key distribution
With the advent of quantum key distribution (QKD) systems, perfect (i.e. information-theoretic) security can now be achieved for distribution of a cryptographic key. QKD systems and similar protocols use classical errorcorrecting codes for both error correction (for the honest parties to correct errors) and privacy amplification (to make an eavesdropper fully ignorant). From a coding perspectiv...
متن کاملOne-round Strongly Secure Key Exchange with Perfect Forward Secrecy and Deniability
Traditionally, secure one-round key exchange protocols in the PKI setting have either achieved perfect forward secrecy, or forms of deniability, but not both. On the one hand, achieving perfect forward secrecy against active attackers seems to require some form of authentication of the messages, as in signed Diffie-Hellman style protocols, that subsequently sacrifice deniability. On the other h...
متن کاملInformation Theoretic Authentication and Secrecy Codes in the Splitting Model
In the splitting model, information theoretic authentication codes allow non-deterministic encoding, that is, several messages can be used to communicate a particular plaintext. Certain applications require that the aspect of secrecy should hold simultaneously. Ogata–Kurosawa–Stinson–Saido (2004) have constructed optimal splitting authentication codes achieving perfect secrecy for the special c...
متن کاملEfficient Maximal Privacy in Boardroom Voting and Anonymous Broadcast
Most voting schemes rely on a number of authorities. If too many of these authorities are dishonest then voter privacy may be violated. To give stronger guarantees of voter privacy Kiayias and Yung [1] introduced the concept of elections with perfect ballot secrecy. In this type of election scheme it is guaranteed that the only thing revealed about voters’ choices is the result of the election,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 125 شماره
صفحات -
تاریخ انتشار 1994